Tootfinder

I found a neat website that helps confirm your bit torrent client config. You can add a magnet URL and the web page will show which IP the client connects from.
#bittorrent #torrent #evilvibes
https://trak.evilvibes.com

This https://arxiv.org/abs/2310.05384 has been replaced.
link: https://scholar.google.com/scholar?q=a

Cartesian double theories: A double-categorical framework for categorical doctrines
The categorified theories known as "doctrines" specify a category equipped with extra structure, analogous to how ordinary theories specify a set with extra structure. We introduce a new framework for doctrines based on double category theory. A cartesian double theory is defined to be a small double category with finite products and a model of a cartesian double theory to be a finite product-preserving lax functor out of it. Many familiar categorical structures are models of cartesian double t…

This https://arxiv.org/abs/2202.13143 has been replaced.
link: https://scholar.google.com/scholar?q=a

Square-weighted zero-sum constants
Let $A\subseteq \mathbb Z_n$ be a subset. A sequence $S=(x_1,\ldots,x_k)$ in $\mathbb Z_n$ is said to be an $A$-weighted zero-sum sequence if there exist $a_1,\ldots,a_k\in A$ such that $a_1x_1+\cdots+a_kx_k=0$. By a square, we shall mean a non-zero square in $\mathbb Z_n$. We determine the smallest natural number $k$, such that every sequence in $\mathbb Z_n$ whose length is $k$, has a square-weighted zero-sum subsequence. We also determine the smallest natural number $k$, such that every sequ…

This https://arxiv.org/abs/2404.11590 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCV_…

A Subspace-Constrained Tyler's Estimator and its Applications to Structure from Motion
We present the subspace-constrained Tyler's estimator (STE) designed for recovering a low-dimensional subspace within a dataset that may be highly corrupted with outliers. STE is a fusion of the Tyler's M-estimator (TME) and a variant of the fast median subspace. Our theoretical analysis suggests that, under a common inlier-outlier model, STE can effectively recover the underlying subspace, even when it contains a smaller fraction of inliers relative to other methods in the field of robust subs…

A Bi-consolidating Model for Joint Relational Triple Extraction
Xiaocheng Luo, Yanping Chen, Ruixue Tang, Ruizhang Huang, Yongbin Qin
https://arxiv.org/abs/2404.03881

A Bi-consolidating Model for Joint Relational Triple Extraction
Current methods to extract relational triples directly make a prediction based on a possible entity pair in a raw sentence without depending on entity recognition. The task suffers from a serious semantic overlapping problem, in which several relation triples may share one or two entities in a sentence. It is weak to learn discriminative semantic features relevant to a relation triple. In this paper, based on a two-dimensional sentence representation, a bi-consolidating model is proposed to add…

On a sunny day in Zurich, Fabian and I dug into the strategy of the (recently relaunched!) #Demokratis project: https://demokratis.ch
Growing from strength to strength, from Prototype into a formidable veh…

Squad Rep's YouTube Page Is a Conspiracy Theorist's Dream (William Bredderman/The Daily Beast)
https://www.thedailybeast.com/squad-rep-jamaal-bowmans-youtube-page-is-a-bonkers-conspiracy-filled-trip
http://www.memeorandum.com/240508/p54#a240508p54

This https://arxiv.org/abs/2401.01884 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets
This paper presents a concrete and a symbolic rewriting logic semantics for parametric time Petri nets with inhibitor arcs (PITPNs), a flexible model of timed systems where parameters are allowed in firing bounds. We prove that our semantics is bisimilar to the "standard" semantics of PITPNs. This allows us to use the rewriting logic tool Maude, combined with SMT solving, to provide sound and complete formal analyses for PITPNs. We develop and implement a new general folding approach for symbol…

There’s a hidden Google search setting that makes searches more precise
Turn on #verbatim #mode in Google searches
On the search results page, look for a menu that says Tools. It may be on the far right side of the screen. 
• On desktop, look on the far right side of the page, to the right of any buttons …

How to Make Google Show You the Good Search Results Again
Off-target search results are getting more and more common, and we can only lay part of the blame on the results being cluttered with AI-generated junk and human-generated SEO-bait. I don’t have a fix for what people (and bots) are writing, nor can I reach into Google’s ranking algorithm and shuffle the pages around. But I can tell you how to get Google to actually search for the thing you typed in.

A Coq Library of Sets for Teaching Denotational Semantics
Qinxiang Cao, Xiwei Wu, Yalun Liang
https://arxiv.org/abs/2404.05459 https://

A Coq Library of Sets for Teaching Denotational Semantics
Sets and relations are very useful concepts for defining denotational semantics. In the Coq proof assistant, curried functions to Prop are used to represent sets and relations, e.g. A -> Prop, A -> B -> Prop, A -> B -> C -> Prop, etc. Further, the membership relation can be encoded by function applications, e.g. X a represents a in X if X: A -> Prop. This is very convenient for developing formal definitions and proofs for professional users, but it makes propositions more difficult to read for …

Discrete Brunn-Minkowski Inequality for subsets of the cube
Lars Becker, Paata Ivanisvili, Dmitry Krachun, J\'ose Madrid
https://arxiv.org/abs/2404.04486

Discrete Brunn-Minkowski Inequality for subsets of the cube
We show that for all subsets $A_1, A_2,\dots, A_n\subseteq\{0,1\}^d$, we have $$ |A_1+A_2+\dots+A_n| \geq \prod_{i=1}^{n}|A_i|^{(\log_{2}(n+1))/n}. $$ In addition, we show that for all $A, B \subseteq \{0,1,2\}^{d}$ we have $$ |A+B|\geq (|A||B|)^{\log(5)/(2\log(3))}.$$ We also show that for all finite $A,B \subset \mathbb{Z}^{d}$, and any $V \subseteq\{0,1\}^{d}$ the inequality $$ |A+B+V|\geq |A|^{1/p}|B|^{1/q}|…

edit_wikiquote: Wikiquote edits (2010)
A bipartite user-page network extracted from Wikiquotes. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 1126 nodes and 3075 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

50 years ago today, a rehearsal at david grisman’s house in stinson beach for what will become the great american string band, debuting later that weekend, feat. #JerryGarcia on #banjo, richard greene on #fiddle

SVan: A Mobile Hub as a Field Robotics Development and Deployment Platform
Alexander Moortgat-Pick, Anna Adamczyk, Daniel A Duecker, Sami Haddadin
https://arxiv.org/abs/2405.03890

SVan: A Mobile Hub as a Field Robotics Development and Deployment Platform
As robotics becomes increasingly vital for environmental protection, there is a growing need for effective deployment methods that match the pace of robotics innovation. Current strategies often fall short, leaving a gap between the potential of robotics and their practical application in the field. Addressing this challenge, we introduce a mobile hub concept designed to provide the necessary infrastructure and support for deploying a diverse, multi-domain robot team effectively. This paper pre…

Mal wieder ein kleiner Einblick auf #wandklexschmuck-Hummelpopo könnt ihr Euch fast immer in der Nähe meines #MoinWelt -Kaffee vorstellen; die trag ich sehr oft dabei. ☺

This https://arxiv.org/abs/2403.18515 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Autonomous Quantum Heat Engine Based on Non-Markovian Dynamics of an Optomechanical Hamiltonian
We propose a recipe for demonstrating an autonomous quantum heat engine where the working fluid consists of a harmonic oscillator, the frequency of which is tuned by a driving mode. The working fluid is coupled two heat reservoirs each exhibiting a peaked power spectrum, a hot reservoir peaked at a higher frequency than the cold reservoir. Provided that the driving mode is initialized in a coherent state with a high enough amplitude and the parameters of the utilized optomechanical Hamiltonian …

A Repository for Formal Contexts
Tom Hanika, Robert J\"aschke
https://arxiv.org/abs/2404.04344 https://arxiv.org/pdf/2404.04344<…

A Repository for Formal Contexts
Data is always at the center of the theoretical development and investigation of the applicability of formal concept analysis. It is therefore not surprising that a large number of data sets are repeatedly used in scholarly articles and software tools, acting as de facto standard data sets. However, the distribution of the data sets poses a problem for the sustainable development of the research field. There is a lack of a central location that provides and describes FCA data sets and links the…

Denver-based Maybell Quantum, which is developing systems to make quantum tech more reliable, scalable, and accessible, raised a $25M Series A (Cassidy Ritter/Denver Business Journal)
https://www.bizjournals.com/denver/inno/st

I have a Word document that I cannot manipulate with my MacBook Pro with an M1 Pro chip with 16GB… and my M2 Pro Mac mini with the same memory has no issue with it at all 🤔
It is just an 88 page document… but with a table with 4484 rows and 5 columns… which is a sparse table. It should not be that difficult…
#MicrosoftWord

How Do OSS Developers Utilize Architectural Solutions from Q&A Sites: An Empirical Study
Musengamana Jean de Dieu, Peng Liang, Mojtaba Shahin
https://arxiv.org/abs/2404.05041 …

How Do OSS Developers Utilize Architectural Solutions from Q&A Sites: An Empirical Study
Developers utilize programming-related knowledge (e.g., code snippets) on Q&A sites (e.g., Stack Overflow) that functionally matches the programming problems they encounter in their development. Despite extensive research on Q&A sites, being a high-level and important type of development-related knowledge, architectural solutions (e.g., architecture tactics) and their utilization are rarely explored. To fill this gap, we conducted a mixed-methods study that includes a mining study and a survey …

Someone in Kenosha was bored, in the best possible way...
#GoodGovernment

A Stabilizing NMPC Strategy for a Class of Nonholonomic Systems with Drift
Huu Thien Nguyen, Fernando A. C. C. Fontes, Ionela Prodan
https://arxiv.org/abs/2403.04748

A Stabilizing NMPC Strategy for a Class of Nonholonomic Systems with Drift
In this paper, we present a stabilizing Nonlinear Model Predictive Control (NMPC) scheme tailored for a class of nonholonomic systems with drift, where the acceleration is laterally restrained. Examples include a mobile robot with drifting wheels on a planar surface or a spacecraft maneuvering in a vacuum. The novelty lies in the formulation of the terminal set, reachable from a significant distance from the equilibrium, and the terminal cost, represented as the integration of the stage cost. T…

This https://arxiv.org/abs/2110.01673 has been replaced.
link: https://scholar.google.com/scholar?q=a

Model-completeness and decidability of the additive structure of integers expanded with a function for a Beatty sequence
We introduce a recursive model-complete theory which completely axiomatizes the structure $Z_α=(Z, +, 0, 1, f)$ where $f : x \to \lfloorα x \rfloor $ is a unary function with $α$ a fixed transcendental number.When α$ is computable, our theory is recursively enumerable, and hence decidable as a result of completeness. Therefore, this result fits into the more general theme of adding traces of multiplication to integers without losing decidability.

This https://arxiv.org/abs/2403.17190 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_hept…

Cardy matches Bethe on the Surface: a Tale of a Brane and a Black Hole
We consider the insertion of a Gukov-Witten surface defect in $\mathrm{SU}(N)$ $\mathcal{N}=4$ SYM corresponding to a probe D3-brane in the holographic dual setup. The defect gives rise to a $4d$-$2d$ coupled system encoding the entropy of the dual perturbed black hole, which can be extracted from the corresponding Superconformal Index. Elaborating on previous studies, we refine the results using both a saddle-point and a Bethe-Ansatz approach. The consistency of our computation is corroborated…

This https://arxiv.org/abs/1904.01884 has been replaced.
link: https://scholar.google.com/scholar?q=a

Projection of root systems
Let $a$ be a real euclidean vector space of finite dimension and $Σ$ a root system in $a$ with a basis $Δ$. Let $Θ\subset Δ$ and $M = M_Θ$ be a standard Levi of a reductive group $G$ such that $a_Θ= a_M / a_G$. Let us denote $d$ the dimension of $a_Θ$, i.e the cardinal of $Δ- Θ$ and $Σ_Θ$ the set of all non-trivial projections of roots in $Σ$. We obtain conditions on $Θ$ such that $Σ_Θ$ contains a root system of rank $d$.

Getting miniprofiler running in #ruby is total pit of success. Install the gem, restart the process, boom. There were always extra steps in #dotnet so it was less pitty.

My Timeline page is a bit like Instagram, but without adverts, influencers, coffee, lunch or vacation pictures!
Instead, I use it to show recent work, experiments, and visualizations.
https://www.andycarolan.com/timeline

Timeline - Andy Carolan
This page highlights recent work, experiments, visualizations, and emotions.

On the Gonality type invariants and the slope of a fibered $3$-fold
Hiroto Akaike
https://arxiv.org/abs/2404.05216 https://arxiv.org/…

On the Gonality type invariants and the slope of a fibered $3$-fold
The \textit{slope} of a fibered $3$-folds $f:X \to B$ is a relative numerical invariant defined by $λ(f) := K_{f}^{3}/\mathrm{deg}(f_{\ast}ω_{f})$, where $K_{f}$ is the relative canonical divisor and $ω_{f}$ is the relative dualizing sheaf. Establishing slope inequalities is a fundamental problem in the geography of fibered spaces. In this paper, we introduce a new invariant called the \textit{minimal covering degree} as a gonality-type invariant and study a lower bound of the slope increasi…

STOP THE COUP 2025 explains how the right wing Heritage Foundation plans to replace American democracy with a dictatorship. Understand their scheme.
https://thedemlabs.org/2024/02/08/content-distribution-tips/

Content distribution: Do it right like STOP THE COUP 2025
How do you explain an 887 page scheme to overthrow American democracy?

I found a neat website that helps confirm your bit torrent client config. You can add a magnet URL and the web page will show which IP the client connects from.
#bittorrent #torrent #evilvibes
https://trak.evilvibes.com

This https://arxiv.org/abs/2312.14908 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

The Adjoint Representation of a Higher Lie Groupoid
We extend the standard construction of the adjoint representation of a Lie groupoid to the case of an arbitrary higher Lie groupoid. As for a Lie groupoid, the adjoint representation of a higher Lie groupoid turns out to be a representation up to homotopy which is well defined up to isomorphism. Its existence and uniqueness are immediate consequences of a more general result in the theory of simplicial vector bundles: the representation up to homotopy obtained by splitting a higher vector bundl…

Squad Rep's YouTube Page Is a Conspiracy Theorist's Dream (William Bredderman/The Daily Beast)
https://www.thedailybeast.com/squad-rep-jamaal-bowmans-youtube-page-is-a-bonkers-conspiracy-filled-trip
http://www.memeorandum.com/240508/p54#a240508p54

Axiomatization of approximate exclusion
Matilda H\"aggblom
https://arxiv.org/abs/2405.04998 https://arxiv.org/pdf/2405.04998

Axiomatization of approximate exclusion
We define and axiomatize approximate exclusion atoms in the team semantic setting. A team is a set of assignments, which can be seen as a mathematical model of a uni-relational database, and we say that an approximate exclusion atom is satisfied in a team if the corresponding usual exclusion atom is satisfied in a large enough subteam. We consider the implication problem for approximate exclusion atoms and show that it is axiomatizable for consequences with a degree of approximation that is not…

Numerical Fuzz: A Type System for Rounding Error Analysis
Ariel E. Kellison, Justin Hsu
https://arxiv.org/abs/2405.04612 https://arxi…

Numerical Fuzz: A Type System for Rounding Error Analysis
Algorithms operating on real numbers are implemented as floating-point computations in practice, but floating-point operations introduce roundoff errors that can degrade the accuracy of the result. We propose $Λ_{num}$, a functional programming language with a type system that can express quantitative bounds on roundoff error. Our type system combines a sensitivity analysis, enforced through a linear typing discipline, with a novel graded monad to track the accumulation of roundoff errors. We …

$A_\alpha$-energy of graphs formed by some unary operations
Najiya V K, Chithra A V
https://arxiv.org/abs/2404.03905 https://arxiv.or…

$A_α$-energy of graphs formed by some unary operations
Let $G $ be a graph on $p$ vertices with adjacency matrix $A(G)$ and degree matrix $D(G)$. For each $α\in [0, 1]$, the $A_α$-matrix is defined as $A_α(G) = αD(G) + (1 - α)A(G)$. In this paper, we compute the $A_α$-characteristic polynomial, $A_α$-spectra and $A_α$-energy of some non-regular graphs obtained from unary operations on graphs like middle graph, central graph, m-splitting, and closed splitting graph. Also, we determine the $A_α$-energy of regular graphs like m-shadow, closed…

This https://arxiv.org/abs/2402.09949 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCL_…

Multi-word Tokenization for Sequence Compression
Large Language Models have proven highly successful at modelling a variety of tasks. However, this comes at a steep computational cost that hinders wider industrial uptake. In this paper, we present MWT: a Multi-Word Tokenizer that goes beyond word boundaries by representing frequent multi-word expressions as single tokens. MWTs produce a more compact and efficient tokenization that yields two benefits: (1) Increase in performance due to a greater coverage of input data given a fixed sequence l…

Explicit constructions of Diophantine tuples over finite fields
Seoyoung Kim, Chi Hoi Yip, Semin Yoo
https://arxiv.org/abs/2404.05514 https://

Explicit constructions of Diophantine tuples over finite fields
A Diophantine $m$-tuple over a finite field $\mathbb{F}_q$ is a set $\{a_1,\ldots, a_m\}$ of $m$ distinct elements in $\mathbb{F}_{q}^{*}$ such that $a_{i}a_{j}+1$ is a square in $\mathbb{F}_q$ whenever $i\neq j$. In this paper, we study $M(q)$, the maximum size of a Diophantine tuple over $\mathbb{F}_q$, assuming the characteristic of $\mathbb{F}_q$ is fixed and $q \to \infty$. By explicit constructions, we improve the lower bound on $M(q)$. In particular, this improves a recent result of Duje…

This https://arxiv.org/abs/2401.06042 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Page-curve-like entanglement dynamics in open quantum systems
The entanglement entropy of a black hole, and that of its Hawking radiation, are expected to follow the so-called Page curve: After an increase in line with Hawking's calculation, it is expected to decrease back to zero once the black hole has fully evaporated, as demanded by unitarity. Recently, a simple system-plus-bath model has been proposed which shows a similar behaviour. Here, we make a general argument as to why such a Page-curve-like entanglement dynamics should be expected to hold gen…

ITA-ECBS: A Bounded-Suboptimal Algorithm for Combined Target-Assignment and Path-Finding Problem
Yimin Tang, Sven Koenig, Jiaoyang Li
https://arxiv.org/abs/2404.05223

ITA-ECBS: A Bounded-Suboptimal Algorithm for Combined Target-Assignment and Path-Finding Problem
Multi-Agent Path Finding (MAPF), i.e., finding collision-free paths for multiple robots, plays a critical role in many applications. Sometimes, assigning a specific target to each agent also presents a challenge. The Combined Target-Assignment and Path-Finding (TAPF) problem, a variant of MAPF, requires simultaneously assigning targets to agents and planning collision-free paths. Several algorithms, including CBM, CBS-TA, and ITA-CBS, can optimally solve the TAPF problem, with ITA-CBS being the…

This https://arxiv.org/abs/2405.01937 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCV_…

An Attention Based Pipeline for Identifying Pre-Cancer Lesions in Head and Neck Clinical Images
Early detection of cancer can help improve patient prognosis by early intervention. Head and neck cancer is diagnosed in specialist centres after a surgical biopsy, however, there is a potential for these to be missed leading to delayed diagnosis. To overcome these challenges, we present an attention based pipeline that identifies suspected lesions, segments, and classifies them as non-dysplastic, dysplastic and cancerous lesions. We propose (a) a vision transformer based Mask R-CNN network for…

This https://arxiv.org/abs/2309.13586 has been replaced.
link: https://scholar.google.com/scholar?q=a

Task-Oriented Dexterous Hand Pose Synthesis Using Differentiable Grasp Wrench Boundary Estimator
This work tackles the problem of task-oriented dexterous hand pose synthesis, which involves generating a static hand pose capable of applying a task-specific set of wrenches to manipulate objects. Unlike previous approaches that focus solely on force-closure grasps, which are unsuitable for non-prehensile manipulation tasks (\textit{e.g.}, turning a knob or pressing a button), we introduce a unified framework covering force-closure grasps, non-force-closure grasps, and a variety of non-prehens…

This https://arxiv.org/abs/2312.01825 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Galois descent for motivic theories
We give necessary conditions for a category fibred in pseudo-abelian additive categories over the classifying topos of a profinite group to be a stack; these conditions are sufficient when the coefficients are $\mathbf{Q}$-linear. This applies to pure motives over a field in the sense of Grothendieck, Deligne-Milne and André, to mixed motives in the sense of Nori and to several motivic categories considered in arXiv:1506.08386 [math.AG]. We also give a simple proof of the exactness of a sequen…

6G Software Engineering: A Systematic Mapping Study
Ruoyu Su, Xiaozhou Li, Davide Taibi
https://arxiv.org/abs/2405.05017 https://arxi…

6G Software Engineering: A Systematic Mapping Study
6G will revolutionize the software world allowing faster cellular communications and a massive number of connected devices. 6G will enable a shift towards a continuous edge-to-cloud architecture. Current cloud solutions, where all the data is transferred and computed in the cloud, are not sustainable in such a large network of devices. Current technologies, including development methods, software architectures, and orchestration and offloading systems, still need to be prepared to cope with suc…

The Church Synthesis Problem over Continuous Time
Alexander Rabinovich, Daniel Fattal
https://arxiv.org/abs/2404.04782 https://arxiv.…

The Church Synthesis Problem over Continuous Time
The Church Problem asks for the construction of a procedure which, given a logical specification A(I,O) between input omega-strings I and output omega-strings O, determines whether there exists an operator F that implements the specification in the sense that A(I, F(I)) holds for all inputs I. Buchi and Landweber provided a procedure to solve the Church problem for MSO specifications and operators computable by finite-state automata. We investigate a generalization of the Church synthesis probl…

This https://arxiv.org/abs/2308.05485 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csPL_…

Substitution for Non-Wellfounded Syntax with Binders through Monoidal Categories
We describe a generic construction of non-wellfounded syntax involving variable binding and its monadic substitution operation. Our construction of the syntax and its substitution takes place in category theory, notably by using monoidal categories and strong functors between them. A language is specified by a multi-sorted binding signature, say Σ. First, we provide sufficient criteria for Σ to generate a language of possibly infinite terms, through ω-continuity. Second, we construct a monad…

Learning Phonotactics from Linguistic Informants
Canaan Breiss, Alexis Ross, Amani Maina-Kilaas, Roger Levy, Jacob Andreas
https://arxiv.org/abs/2405.04726

Learning Phonotactics from Linguistic Informants
We propose an interactive approach to language learning that utilizes linguistic acceptability judgments from an informant (a competent language user) to learn a grammar. Given a grammar formalism and a framework for synthesizing data, our model iteratively selects or synthesizes a data-point according to one of a range of information-theoretic policies, asks the informant for a binary judgment, and updates its own parameters in preparation for the next query. We demonstrate the effectiveness o…

This https://arxiv.org/abs/2303.03762 has been replaced.
link: https://scholar.google.com/scholar?q=a

New strategy on the existence of a spanning tree without small degree stems
For an integer $k\geq 2$, a spanning tree of a graph without no vertices of degree from $2$ to $k$ is call a {\it $[2,k]$-ST} of the graph. The concept of $[2,k]$-STs is a natural extension of a homeomorphically irreducible spanning tree (or HIST), which has been a well-studied graph-structure. In this paper, we give a new strategy for finding $[2,k]$-STs. By using the strategy, we refine or extend a known degree-sum condition for the existence of a HIST. Furthermore, we also investigate on a d…

AI2Apps: A Visual IDE for Building LLM-based AI Agent Applications
Xin Pang, Zhucong Li, Jiaxiang Chen, Yuan Cheng, Yinghui Xu, Yuan Qi
https://arxiv.org/abs/2404.04902

AI2Apps: A Visual IDE for Building LLM-based AI Agent Applications
We introduce AI2Apps, a Visual Integrated Development Environment (Visual IDE) with full-cycle capabilities that accelerates developers to build deployable LLM-based AI agent Applications. This Visual IDE prioritizes both the Integrity of its development tools and the Visuality of its components, ensuring a smooth and efficient building experience.On one hand, AI2Apps integrates a comprehensive development toolkit ranging from a prototyping canvas and AI-assisted code editor to agent debugger, …

This https://arxiv.org/abs/2312.15753 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Control and readout of a transmon using a compact superconducting resonator
We demonstrate control and readout of a superconducting artificial atom based on a transmon qubit using a compact lumped-element resonator. The resonator consists of a parallel-plate capacitor (PPC) with a wire geometric inductor. The footprint of the resonators is about 200 μm by 200 μm, which is similar to the standard transmon size and one or two orders of magnitude more compact in the occupied area comparing to coplanar waveguide resonators. We observe coherent Rabi oscillations and obtai…

The family of $a$-floor quotient partial orders
Jeffrey C. Lagarias, David Harry Richman
https://arxiv.org/abs/2403.04342 https://arx…

The family of $a$-floor quotient partial orders
An approximate divisor order is a partial order on the positive integers $\mathbb{N}^+$ that refines the divisor order and is refined by the additive total order. A previous paper studied such a partial order on $\mathbb{N}^+$, produced using the floor function. A positive integer $d$ is a floor quotient of $n$, denoted $d \,\preccurlyeq_{1}\, n$, if there is a positive integer $k$ such that $d = \lfloor{n / k}\rfloor$. The floor quotient relation defines a partial order on the positive integer…

This https://arxiv.org/abs/2404.03635 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCV_…

WorDepth: Variational Language Prior for Monocular Depth Estimation
Three-dimensional (3D) reconstruction from a single image is an ill-posed problem with inherent ambiguities, i.e. scale. Predicting a 3D scene from text description(s) is similarly ill-posed, i.e. spatial arrangements of objects described. We investigate the question of whether two inherently ambiguous modalities can be used in conjunction to produce metric-scaled reconstructions. To test this, we focus on monocular depth estimation, the problem of predicting a dense depth map from a single ima…

This https://arxiv.org/abs/2404.14597 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Higher categories of push-pull spans, I: Construction and applications
This is the first part of a project aimed at formalizing Rozansky-Witten models in the functorial field theory framework. Motivated by work of Calaque-Haugseng-Scheimbauer, we construct a family of symmetric monoidal $(\infty,3)$-categories parametrized by an $\infty$-category with finite limits and a functor into symmetric monoidal $\infty$-categories, such that the functor admits pushforwards. This $(\infty,3)$-category contains correspondences in the base $\infty$-category equipped with loca…

This https://arxiv.org/abs/2405.03450 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

The spectral genus of an isolated hypersurface singularity and a conjecture relating to the Milnor number
In this paper, we introduce the notion of spectral genus $\widetilde{p}_{g}$ of a deformation of a germ of an isolated hypersurface singularity $(\mathbb{C}^{n+1}, 0) \to (\mathbb{C}, 0)$, defined as a sum of small exponents of monodromy eigenvalues. The number of these is equal to the geometric genus $p_{g}$, and hence $\widetilde{p}_g$ can be considered as a secondary invariant to it. We then explore a secondary version of the Durfee conjecture on $p_{g}$, regarding the relationship between $…

Bayesian Simultaneous Localization and Multi-Lane Tracking Using Onboard Sensors and a SD Map
Yuxuan Xia, Erik Stenborg, Junsheng Fu, Gustaf Hendeby
https://arxiv.org/abs/2405.04290

Bayesian Simultaneous Localization and Multi-Lane Tracking Using Onboard Sensors and a SD Map
High-definition map with accurate lane-level information is crucial for autonomous driving, but the creation of these maps is a resource-intensive process. To this end, we present a cost-effective solution to create lane-level roadmaps using only the global navigation satellite system (GNSS) and a camera on customer vehicles. Our proposed solution utilizes a prior standard-definition (SD) map, GNSS measurements, visual odometry, and lane marking edge detection points, to simultaneously estimate…

This https://arxiv.org/abs/2309.12164 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csPL_…

Stratified Type Theory
A hierarchy of type universes is a rudimentary ingredient in the type theories of many proof assistants to prevent the logical inconsistency resulting from combining dependent functions and the type-in-type rule. In this work, we argue that a universe hierarchy is not the only option for a type theory with a type universe. Taking inspiration from Leivant's Stratified System F, we introduce Stratified Type Theory (StraTT), where rather than stratifying universes by levels, we stratify typing jud…

This https://arxiv.org/abs/2310.08779 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

A Completeness Theorem for Probabilistic Regular Expressions
We introduce Probabilistic Regular Expressions (PRE), a probabilistic analogue of regular expressions denoting probabilistic languages in which every word is assigned a probability of being generated. We present and prove the completeness of an inference system for reasoning about probabilistic language equivalence of PRE based on Salomaa's axiomatisation of Kleene Algebra.

Learning Phonotactics from Linguistic Informants
Canaan Breiss, Alexis Ross, Amani Maina-Kilaas, Roger Levy, Jacob Andreas
https://arxiv.org/abs/2405.04726

Learning Phonotactics from Linguistic Informants
We propose an interactive approach to language learning that utilizes linguistic acceptability judgments from an informant (a competent language user) to learn a grammar. Given a grammar formalism and a framework for synthesizing data, our model iteratively selects or synthesizes a data-point according to one of a range of information-theoretic policies, asks the informant for a binary judgment, and updates its own parameters in preparation for the next query. We demonstrate the effectiveness o…

This https://arxiv.org/abs/2309.06629 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csAI_…

The Relational Bottleneck as an Inductive Bias for Efficient Abstraction
A central challenge for cognitive science is to explain how abstract concepts are acquired from limited experience. This has often been framed in terms of a dichotomy between connectionist and symbolic cognitive models. Here, we highlight a recently emerging line of work that suggests a novel reconciliation of these approaches, by exploiting an inductive bias that we term the relational bottleneck. In that approach, neural networks are constrained via their architecture to focus on relations be…

On the Erd\H{o}s-Tur\'an Conjecture and the growth of $B_{2}[g]$ sequences
Javier Pliego
https://arxiv.org/abs/2405.04154 https://

On the Erdős-Turán Conjecture and the growth of $B_{2}[g]$ sequences
When $g\in\mathbb{N}$ we say that $A\subset\mathbb{N}$ is a $B_{2}[g]$ sequence if every $m\in\mathbb{N}$ has at most $g$ distinct representations of the shape $m=b_{1}+b_{2}$ with $b_{1}\leq b_{2}$ and $b_{1},b_{2}\in A$. We show for every $0<\varepsilon<1$ that whenever $g>\frac{1}{\varepsilon}$ then there is a $B_{2}[g]$ sequence $A$ having the property that every sufficiently large $n\in\mathbb{N}$ can be written as $$n=a_{1}+a_{2}+a_{3},\ \ \ \ \ \ \ \ \ a_{3}\leq n^{\varepsilon}\ \ \ \ \ …

The bishop and knight checkmate on a large chessboard
Johan W\"astlund
https://arxiv.org/abs/2405.04421 https://arxiv.org/pdf/24…

The bishop and knight checkmate on a large chessboard
In 1983 the chess periodical EG published a summary of a letter from Julius Telesin outlining how a king, a bishop and a knight can checkmate a lonely king on an arbitrarily large chessboard. The Telesin checkmating procedure doesn't seem to be widely known, and the published account left out a number of details. We describe the method precisely and show that it works against every defense. We also discuss the open question of the asymptotics of the largest distance to mate on a large square bo…

Naive homotopy theories in cartesian closed categories
Enrique Ruiz Hern\'andez, Pedro Sol\'orzano
https://arxiv.org/abs/2405.03793 https://…

Naive homotopy theories in cartesian closed categories
An elementary notion of homotopy can be introduced between arrows in a cartesian closed category $E$. The input is a finite-product-preserving endofunctor $Π_0$ with a natural transformation $p$ from the identity which is surjective on global elements. As expected, the output is a new category $E_p$ with objects the same objects as $E$. Further assumptions on $E$ provide a finer description of $E_p$ that relates it to the classical homotopy theory where $Π_0$ could be interpreted as the ``p…

This https://arxiv.org/abs/2312.07539 has been replaced.
link: https://scholar.google.com/scholar?q=a

HeadArtist: Text-conditioned 3D Head Generation with Self Score Distillation
This work presents HeadArtist for 3D head generation from text descriptions. With a landmark-guided ControlNet serving as the generative prior, we come up with an efficient pipeline that optimizes a parameterized 3D head model under the supervision of the prior distillation itself. We call such a process self score distillation (SSD). In detail, given a sampled camera pose, we first render an image and its corresponding landmarks from the head model, and add some particular level of noise onto …

This https://arxiv.org/abs/2404.04081 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Clock offset recovery with sublinear complexity enables synchronization on low-level hardware for quantum key distribution
We introduce iQSync, a clock offset recovery method designed for implementation on low-level hardware, such as FPGAs or microcontrollers, for quantum key distribution (QKD). iQSync requires minimal memory, only a simple instruction set (e.g. no floating-point operations), and can be evaluated with sublinear time complexity, typically involving no more than a few thousand iterations of a simple loop. Furthermore, iQSync allows for a precise clock offset recovery within few seconds, even for larg…

This https://arxiv.org/abs/2306.16330 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

Proving Confluence in the Confluence Framework with CONFident
This article describes the *Confluence Framework*, a novel framework for proving and disproving confluence using a divide-and-conquer modular strategy, and its implementation in CONFident. Using this approach, we are able to automatically prove and disprove confluence of *Generalized Term Rewriting Systems*, where (i) only selected arguments of function symbols can be rewritten and (ii) a rather general class of conditional rules can be used. This includes, as particular cases, several variants…

Asymptotic formula for the sum of a prime and a square-full number in short intervals
Fumi Ogihara, Yuta Suzuki
https://arxiv.org/abs/2405.04509 https://…

Asymptotic formula for the sum of a prime and a square-full number in short intervals
Let $R_{m, \mathrm{sq-full}}(N)$ be a representation function for the sum of a prime and a square-full number. In this article, we prove an asymptotic formula for the sum of $R_{m, \mathrm{sq-full}}(N)$ over positive integers $N$ in a short interval ($X$, $X+H$] of length $H$ slightly bigger than $X^{\frac{1}{2}}$.

On combinatorial structure and algebraic characterizations of distance-regular digraphs
Giusy Monzillo, Safet Peni\'c
https://arxiv.org/abs/2404.03910 …

On combinatorial structure and algebraic characterizations of distance-regular digraphs
Let $Γ=Γ(A)$ denote a simple strongly connected digraph with vertex set $X$, diameter $D$, and let $\{A_0,A:=A_1,A_2,\ldots,A_D\}$ denote the set of distance-$i$ matrices of $Γ$. Let $\{R_i\}_{i=0}^D$ denote a partition of $X\times X$, where $R_i=\{(x,y)\in X\times X\mid (A_i)_{xy}=1\}$ $(0\le i\le D)$. The digraph $Γ$ is distance-regular if and only if $(X,\{R_i\}_{i=0}^D)$ is a commutative association scheme. In this paper, we describe the combinatorial structure of $Γ$ in the sense of e…

SAT-DIFF: A Tree Diffing Framework Using SAT Solving
Chuqin Geng, Haolin Ye, Yihan Zhang, Brigitte Pientka, Xujie Si
https://arxiv.org/abs/2404.04731 https…

SAT-DIFF: A Tree Diffing Framework Using SAT Solving
Computing differences between tree-structured data is a critical but challenging problem in software analysis. In this paper, we propose a novel tree diffing approach called SatDiff, which reformulates the structural diffing problem into a MaxSAT problem. By encoding the necessary transformations from the source tree to the target tree, SatDiff generates correct, minimal, and type safe low-level edit scripts with formal guarantees. We then synthesize concise high-level edit scripts by effective…

This https://arxiv.org/abs/2401.14295 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCL_…

Demystifying Chains, Trees, and Graphs of Thoughts
The field of natural language processing (NLP) has witnessed significant progress in recent years, with a notable focus on improving large language models' (LLM) performance through innovative prompting techniques. Among these, prompt engineering coupled with structures has emerged as a promising paradigm, with designs such as Chain-of-Thought, Tree of Thoughts, or Graph of Thoughts, in which the overall LLM reasoning is guided by a structure such as a graph. As illustrated with numerous exampl…

This https://arxiv.org/abs/2309.08395 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csAI_…

Learning by Self-Explaining
Current AI research mainly treats explanations as a means for model inspection. Yet, this neglects findings from human psychology that describe the benefit of self-explanations in an agent's learning process. Motivated by this, we introduce a novel approach in the context of image classification, termed Learning by Self-Explaining (LSX). LSX utilizes aspects of self-refining AI and human-guided explanatory machine learning. The underlying idea is that a learner model, in addition to optimizing …

This https://arxiv.org/abs/2404.02257 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCV_…

SnAG: Scalable and Accurate Video Grounding
Temporal grounding of text descriptions in videos is a central problem in vision-language learning and video understanding. Existing methods often prioritize accuracy over scalability -- they have been optimized for grounding only a few text queries within short videos, and fail to scale up to long videos with hundreds of queries. In this paper, we study the effect of cross-modal fusion on the scalability of video grounding models. Our analysis establishes late fusion as a more cost-effective f…

This https://arxiv.org/abs/2403.02321 has been replaced.
link: https://scholar.google.com/scholar?q=a

Quantum-enhanced sensing of axion dark matter with a transmon-based single microwave photon counter
We report an axion dark matter search with a haloscope equipped with a microwave photon counter. The haloscope is a tunable high quality factor 3-dimensional microwave cavity placed in a magnetic field. The photon counter, operated cyclically, maps an incoming microwave photon onto the state of a superconducting transmon qubit. The measurement protocol continuously monitors the power emitted by the haloscope cavity as well as the dark count background, and enables tuning of the cavity frequency…

This https://arxiv.org/abs/2210.13020 has been replaced.
link: https://scholar.google.com/scholar?q=a

On Tools for Completeness of Kleene Algebra with Hypotheses
In the literature on Kleene algebra, a number of variants have been proposed which impose additional structure specified by a theory, such as Kleene algebra with tests (KAT) and the recent Kleene algebra with observations (KAO), or make specific assumptions about certain constants, as for instance in NetKAT. Many of these variants fit within the unifying perspective offered by Kleene algebra with hypotheses, which comes with a canonical language model constructed from a given set of hypotheses.…

Minimal gap for higher dimensional sequences
Tanmoy Bera
https://arxiv.org/abs/2404.05455 https://arxiv.org/pdf/2404.05455

Minimal gap for higher dimensional sequences
In this note, we extend the notion of minimal gaps to the higher dimensional sequences. We bound the minimal gap for $(\{\boldsymbol{a}_n\boldsymbolα\}),$ $(\{a_n\boldsymbolα\})$ and $(\{\boldsymbol{a}_n\cdot\boldsymbolα\})$ in terms of cardinality of the difference set of $a_n$ and $\boldsymbol{a}_n,$ where $a_n$ and $a_n^{(1)},\dots,a_n^{(d)}$ are sequences of distinct integers.

A Bollob\'as-type problem: from root systems to Erd\H{o}s-Ko-Rado
Patrick J. Browne, Q\"endrim R. Gashi, Padraig \'O Cath\'ain
https://arxiv.org/abs/2404.04867

A Bollobás-type problem: from root systems to Erdős-Ko-Rado
Motivated by an Erdős--Ko--Rado type problem on sets of strongly orthogonal roots in the $A_{\ell}$ root system, we estimate bounds for the size of a family of pairs $(A_{i}, B_{i})$ of $k$-subsets in $\{ 1, 2, \ldots, n\}$ such that $A_{i} \cap B_{j}= \emptyset$ and $|A_{i} \cap A_{j}| + |B_{i} \cap B_{j}| = k$ for all $i \neq j$. This is reminiscent of a classic problem of Bollobás. We provide upper and lower bounds for this problem, relying on classical results of extre…

This https://arxiv.org/abs/2404.18255 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCL_…

PatentGPT: A Large Language Model for Intellectual Property
In recent years, large language models have attracted significant attention due to their exceptional performance across a multitude of natural language process tasks, and have been widely applied in various fields. However, the application of large language models in the Intellectual Property (IP) space is challenging due to the strong need for specialized knowledge, privacy protection, processing of extremely long text in this field. In this technical report, we present for the first time a lo…

This https://arxiv.org/abs/2403.02781 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCV_…

PromptKD: Unsupervised Prompt Distillation for Vision-Language Models
Prompt learning has emerged as a valuable technique in enhancing vision-language models (VLMs) such as CLIP for downstream tasks in specific domains. Existing work mainly focuses on designing various learning forms of prompts, neglecting the potential of prompts as effective distillers for learning from larger teacher models. In this paper, we introduce an unsupervised domain prompt distillation framework, which aims to transfer the knowledge of a larger teacher model to a lightweight target mo…

Do We Really Need a Complex Agent System? Distill Embodied Agent into a Single Model
Zhonghan Zhao, Ke Ma, Wenhao Chai, Xuan Wang, Kewei Chen, Dongxu Guo, Yanting Zhang, Hongwei Wang, Gaoang Wang
https://arxiv.org/abs/2404.04619

Do We Really Need a Complex Agent System? Distill Embodied Agent into a Single Model
With the power of large language models (LLMs), open-ended embodied agents can flexibly understand human instructions, generate interpretable guidance strategies, and output executable actions. Nowadays, Multi-modal Language Models~(MLMs) integrate multi-modal signals into LLMs, further bringing richer perception to entity agents and allowing embodied agents to perceive world-understanding tasks more delicately. However, existing works: 1) operate independently by agents, each containing multip…

This https://arxiv.org/abs/2207.03418 has been replaced.
link: https://scholar.google.com/scholar?q=a

Parallel Dual-Numbers Reverse AD
Where dual-numbers forward-mode automatic differentiation (AD) pairs each scalar value with its tangent value, dual-numbers reverse-mode AD attempts to achieve reverse AD using a similarly simple idea: by pairing each scalar value with a backpropagator function. Its correctness and efficiency on higher-order input languages have been analysed by Brunel, Mazza and Pagani, but this analysis used a custom operational semantics for which it is unclear whether it can be implemented efficiently. We t…

This https://arxiv.org/abs/2203.00362 has been replaced.
link: https://scholar.google.com/scholar?q=a

Reasonable Space for the $λ$-Calculus, Logarithmically
Can the $λ$-calculus be considered a reasonable computational model? Can we use it for measuring the time $\textit{and}$ space consumption of algorithms? While the literature contains positive answers about time, much less is known about space. This paper presents a new reasonable space cost model for the $λ$-calculus, based on a variant over the Krivine abstract machine. For the first time, this cost model is able to accommodate logarithmic space. Moreover, we study the time behavior of our …

This https://arxiv.org/abs/2405.02937 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCL_…

Unraveling the Dominance of Large Language Models Over Transformer Models for Bangla Natural Language Inference: A Comprehensive Study
Natural Language Inference (NLI) is a cornerstone of Natural Language Processing (NLP), providing insights into the entailment relationships between text pairings. It is a critical component of Natural Language Understanding (NLU), demonstrating the ability to extract information from spoken or written interactions. NLI is mainly concerned with determining the entailment relationship between two statements, known as the premise and hypothesis. When the premise logically implies the hypothesis, …

This https://arxiv.org/abs/2402.04101 has been replaced.
link: https://scholar.google.com/scholar?q=a

VRMM: A Volumetric Relightable Morphable Head Model
In this paper, we introduce the Volumetric Relightable Morphable Model (VRMM), a novel volumetric and parametric facial prior for 3D face modeling. While recent volumetric prior models offer improvements over traditional methods like 3D Morphable Models (3DMMs), they face challenges in model learning and personalized reconstructions. Our VRMM overcomes these by employing a novel training framework that efficiently disentangles and encodes latent spaces of identity, expression, and lighting into…

This https://arxiv.org/abs/2302.02872 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Limiting distributions of conjugate algebraic integers
Let $Σ\subset \mathbb{C}$ be a compact subset of the complex plane, and $μ$ be a probability distribution on $Σ$. We give necessary and sufficient conditions for $μ$ to be the weak* limit of a sequence of uniform probability measures on a complete set of conjugate algebraic integers lying eventually in any open set containing $Σ$. Given $n\geq 0$, any probability measure $μ$ satisfying our necessary conditions, and any open set $D$ containing $Σ$, we develop and implement a polynomial ti…

The Case for Developing a Foundation Model for Planning-like Tasks from Scratch
Biplav Srivastava, Vishal Pallagani
https://arxiv.org/abs/2404.04540 https:…

The Case for Developing a Foundation Model for Planning-like Tasks from Scratch
Foundation Models (FMs) have revolutionized many areas of computing, including Automated Planning and Scheduling (APS). For example, a recent study found them useful for planning problems: plan generation, language translation, model construction, multi-agent planning, interactive planning, heuristics optimization, tool integration, and brain-inspired planning. Besides APS, there are many seemingly related tasks involving the generation of a series of actions with varying guarantees of their ex…

This https://arxiv.org/abs/2305.04311 has been replaced.
link: https://scholar.google.com/scholar?q=a

Egglog Python: A Pythonic Library for E-graphs
E-graphs have emerged as a versatile data structure with applications in synthesis, optimization, and verification through techniques such as equality saturation. This paper introduces Python bindings for the experimental egglog library (previously called egg-smol), which aims to bring the benefits of e-graphs to the Python ecosystem. The bindings offer a high-level, Pythonic API providing an accessible and familiar interface for Python users. By integrating e-graph techniques with Python, we h…

This https://arxiv.org/abs/2404.00446 has been replaced.
link: https://scholar.google.com/scholar?q=a

Towards a Semantic Characterisation of Global Type Well-formedness
We address the question of characterising the well-formedness properties of multiparty session types semantically, i.e., as properties of the semantic model used to interpret types. Choosing Prime Event Structures (PESs) as our semantic model, we present semantic counterparts for the two properties that underpin global type well-formedness, namely projectability and boundedness, in this model. As a first step towards a characterisation of the class of PESs corresponding to well-formed global t…

This https://arxiv.org/abs/2404.12489 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCL_…

Grammatical Error Correction for Code-Switched Sentences by Learners of English
Code-switching (CSW) is a common phenomenon among multilingual speakers where multiple languages are used in a single discourse or utterance. Mixed language utterances may still contain grammatical errors however, yet most existing Grammar Error Correction (GEC) systems have been trained on monolingual data and not developed with CSW in mind. In this work, we conduct the first exploration into the use of GEC systems on CSW text. Through this exploration, we propose a novel method of generating …

This https://arxiv.org/abs/2403.14874 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCV_…

WeatherProof: Leveraging Language Guidance for Semantic Segmentation in Adverse Weather
We propose a method to infer semantic segmentation maps from images captured under adverse weather conditions. We begin by examining existing models on images degraded by weather conditions such as rain, fog, or snow, and found that they exhibit a large performance drop as compared to those captured under clear weather. To control for changes in scene structures, we propose WeatherProof, the first semantic segmentation dataset with accurate clear and adverse weather image pairs that share an un…

This https://arxiv.org/abs/2311.07837 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Gauss's form class groups and Shimura's canonical models
Let $N$ be a positive integer and $Γ$ be a subgroup of $\mathrm{SL}_2(\mathbb{Z})$ containing $Γ_1(N)$. Let $K$ be an imaginary quadratic field and $\mathcal{O}$ be an order of discriminant $D_\mathcal{O}$ in $K$. Under some assumptions, we show that $Γ$ induces a form class group of discriminant $D_\mathcal{O}$ (or of order $\mathcal{O}$) and level $N$ if and only if there is a certain canonical model of the modular curve for $Γ$ defined over a suitably small number field. In this way we c…

This https://arxiv.org/abs/2308.14581 has been replaced.
link: https://scholar.google.com/scholar?q=a

Many-valued coalgebraic logic over semi-primal varieties
We study many-valued coalgebraic logics with semi-primal algebras of truth-degrees. We provide a systematic way to lift endofunctors defined on the variety of Boolean algebras to endofunctors on the variety generated by a semi-primal algebra. We show that this can be extended to a technique to lift classical coalgebraic logics to many-valued ones, and that (one-step) completeness and expressivity are preserved under this lifting. For specific classes of endofunctors, we also describe how to obt…

Forget NLI, Use a Dictionary: Zero-Shot Topic Classification for Low-Resource Languages with Application to Luxembourgish
Fred Philippy, Shohreh Haddadan, Siwen Guo
https://arxiv.org/abs/2404.03912

Forget NLI, Use a Dictionary: Zero-Shot Topic Classification for Low-Resource Languages with Application to Luxembourgish
In NLP, zero-shot classification (ZSC) is the task of assigning labels to textual data without any labeled examples for the target classes. A common method for ZSC is to fine-tune a language model on a Natural Language Inference (NLI) dataset and then use it to infer the entailment between the input document and the target labels. However, this approach faces certain challenges, particularly for languages with limited resources. In this paper, we propose an alternative solution that leverages d…

This https://arxiv.org/abs/2307.07438 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

The Shimura lift and congruences for modular forms with the eta multiplier
The Shimura correspondence is a fundamental tool in the study of half-integral weight modular forms. In this paper, we prove a Shimura-type correspondence for spaces of half-integral weight cusp forms which transform with a power of the Dedekind eta multiplier twisted by a Dirichlet character. We prove that the lift of a cusp form of weight $λ+1/2$ and level $N$ has weight $2λ$ and level $6N$, and is new at the primes $2$ and $3$ with specified Atkin-Lehner eigenvalues. This precise informati…

This https://arxiv.org/abs/2405.04312 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCV_…

Inf-DiT: Upsampling Any-Resolution Image with Memory-Efficient Diffusion Transformer
Diffusion models have shown remarkable performance in image generation in recent years. However, due to a quadratic increase in memory during generating ultra-high-resolution images (e.g. 4096*4096), the resolution of generated images is often limited to 1024*1024. In this work. we propose a unidirectional block attention mechanism that can adaptively adjust the memory overhead during the inference process and handle global dependencies. Building on this module, we adopt the DiT structure for u…

This https://arxiv.org/abs/2305.07163 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

Lattice-preserving $\mathcal{ALC}$ ontology embeddings
Generating vector representations (embeddings) of OWL ontologies is a growing task due to its applications in predicting missing facts and knowledge-enhanced learning in fields such as bioinformatics. The underlying semantics of OWL ontologies is expressed using Description Logics (DLs). Initial approaches to generate embeddings relied on constructing a graph out of ontologies, neglecting the semantics of the logic therein. Recent semantic-preserving embedding methods often target lightweight D…

This https://arxiv.org/abs/2404.01054 has been replaced.
link: https://scholar.google.com/scholar?q=a

Regularized Best-of-N Sampling to Mitigate Reward Hacking for Language Model Alignment
Best-of-N (BoN) sampling with a reward model has been shown to be an effective strategy for aligning Large Language Models (LLMs) to human preferences at the time of decoding. BoN sampling is susceptible to a problem known as reward hacking. Because the reward model is an imperfect proxy for the true objective, over-optimizing its value can compromise its performance on the true objective. A common solution to prevent reward hacking in preference learning techniques is to optimize a reward usin…

This https://arxiv.org/abs/2306.04089 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

Fully Automated Verification of Linear Time-Invariant Systems against Signal Temporal Logic Specifications via Reachability Analysis
While reachability analysis is one of the most promising approaches for formal verification of dynamic systems, a major disadvantage preventing a more widespread application is the requirement to manually tune algorithm parameters such as the time step size. Manual tuning is especially problematic if one aims to verify that the system satisfies complicated specifications described by signal temporal logic formulas since the effect the tightness of the reachable set has on the satisfaction of th…

This https://arxiv.org/abs/2309.06764 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

Adding an Implication to Logics of Perfect Paradefinite Algebras
Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras. Their associated multiple-conclusion (Set-Set) and single-conclusion (Set-Fmla) order-preserving logics are non-algebraizable self-extensional logics of formal inconsistency and undeterminedness determined by a six-valued matrix, studied in depth by Gomes et…

This https://arxiv.org/abs/2402.10293 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

Parallel Play Saves Quantifiers
The number of quantifiers needed to express first-order properties is captured by two-player combinatorial games called multi-structural (MS) games. We play these games on linear orders and strings, and introduce a technique we call "parallel play", that dramatically reduces the number of quantifiers needed in many cases. Linear orders and strings are the most basic representatives of ordered structures -- a class of structures that has historically been notoriously difficult to analyze. Yet, i…

Refutability as Recursive as Provability
Paola Cattabriga
https://arxiv.org/abs/2404.04038 https://arxiv.org/pdf/2404.04038

Refutability as Recursive as Provability
Godel numbering is an arithmetization of sintax which defines provability by coding a primitive recursive predicate, Pf(x,v). A multiplicity of researches and results all around this well-known recursive predicate are today widespread in many areas of logic and AI. Not equally investigated is the refutability predicate defined by Godel numbering within the same primitive recursive status. Rf(x,v) can be defined as a recursive predicate meaning that x is the Godel number of a refutation in PA of…

Linear Contextual Metaprogramming and Session Types
Pedro \^Angelo (LIACC,Faculdade de Ci\^encias da Universidade do Porto, Portugal), Atsushi Igarashi (Kyoto University, Kyoto, Japan), Vasco T. Vasconcelos (LASIGE, Faculdade de Ci\^encias da Universidade de Lisboa, Portugal)
https://arxiv.org/abs/2404.05475

Linear Contextual Metaprogramming and Session Types
We explore the integration of metaprogramming in a call-by-value linear lambda-calculus and sketch its extension to a session type system. We build on a model of contextual modal type theory with multi-level contexts, where contextual values, closing arbitrary terms over a series of variables, may then be boxed and transmitted in messages. Once received, one such value may then be unboxed (with a let-box construct) and locally applied before being run. We present a series of examples where serv…

Quantitative Weakest Hyper Pre: Unifying Correctness and Incorrectness Hyperproperties via Predicate Transformers
Linpeng Zhang, Noam Zilberstein, Benjamin Lucien Kaminski, Alexandra Silva
https://arxiv.org/abs/2404.05097

Quantitative Weakest Hyper Pre: Unifying Correctness and Incorrectness Hyperproperties via Predicate Transformers
We present a novel \emph{weakest pre calculus} for \emph{reasoning about quantitative hyperproperties} over \emph{nondeterministic and probabilistic} programs. Whereas existing calculi allow reasoning about the expected value that a quantity assumes after program termination from a \emph{single initial state}, we do so for \emph{initial sets of states} or \emph{initial probability distributions}. We thus (i)~obtain a weakest pre calculus for hyper Hoare logic and (ii)~enable reasoning about so-…